#include <bits/stdc++.h>
// 2025/01/29
// tag: 
// Author: Zhang Muen
using namespace std;

int n;
unordered_set<int> s;

void dfs(int x, int intersection){
    if (x == n)
    {
        s.insert(intersection);
        return;
    }
    for (int i = x + 1; i <= n; i++)
        dfs(i, intersection + (i - x) * i);
}

signed main()
{
    cin >> n;
    dfs(0, 0);
    cout << s.size() << endl;
    return 0;
}